Imprecise Computation Model, Synchronous Periodic Real-time Task Sets and Total Weighted Error
نویسندگان
چکیده
منابع مشابه
A Real-Time Parallel Scheduler for the Imprecise Computation Model
This paper considers the problem of scheduling hard real-time, periodic jobs on a multiprocessor while allowing imprecise computations. A highly dynamic job set is assumed, where limited a priori knowledge of a job set's behavior is available. The use of static partitioning schemes for such a job set is shown to lead to load imbalances and unecessary error. Instead, a dynamic load balancing app...
متن کاملImproved Feasibility Tests for Asynchronous Real-Time Periodic Task Sets
The feasibility test for synchronous task systems scheduled by EDF is a well known problem in the literature. However, the analysis of task systems with deadlines shorter than the periods of the tasks has a high runtime complexity. This problem increases if we consider asynchronous task sets. In this paper, the runtime complexity of Pellizzoni’s approach to the analysis of asynchronous task set...
متن کاملIncorporating Error Recovery into the Imprecise Computation Model
In this paper; we describe optimal algorithms for incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional part. The mandatory part must be completed within the task’s deadline even in the presence of faults and a reward function is associated with the execution of each optional part. We address the problem of optimal schedul...
متن کاملOn Applying Imprecise Computation to Real-Time AI Systems
Imprecise computation is known as a technique for real-time systems where precise outputs are traded off for timely responses to system events. This paper discusses how the technique can be applied to a class of real-time AI systems designed for solving combinatorial problems and proposes an evaluation method for assessing if imprecise computation can satisfy both the timing and functional requ...
متن کاملError-Driven QoS Management in Imprecise Real-Time Databases
In applications such as web-applications, e-commerce, and engine control, the demand for real-time data services has increased. In these applications, requests have to be processed within their deadlines using fresh data. Since the workload of these systems cannot be precisely predicted, they can become overloaded and as a result, deadline and freshness violations may occur. To address this pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2010
ISSN: 1330-1136,1846-3908
DOI: 10.2498/cit.1001879